Matching Ontologies through Multi-Objective Evolutionary Algorithm with Relevance Matrix

نویسندگان

چکیده

The ultimate goal of semantic web (SW) is to implement mutual collaborations among ontology-based intelligent systems. To this end, it necessary integrate those domain-independent and cross-domain ontologies by finding the correspondences between their entities, which so-called ontology matching. improve quality alignment, in work, matching problem first defined as a sparse multi-objective optimization (SMOOP), then, evolutionary algorithm with relevance matrix (MOEA-RM) proposed address it. In particular, (RM) presented adaptively measure each individual’s genes objectives, applied MOEA’s initialization, crossover mutation ensure population’s sparsity speed up algorithm’s convergence. experiment verifies performance MOEA-RM comparing state-of-the-art techniques, experimental results show that able effectively different heterogeneity characteristics.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Using Chi-square Matrix to Strengthen Multi-objective Evolutionary Algorithm

Many complex engineering problems have multi-objectives where each objective is conflicting with others. However, a lot research Jiradej Ponsawat et al. 2 works in optimization by Competent Genetic Algorithm are focused on single objective methods. These algorithms work very well for single objective problems but stumble when trying to discover a large number of solutions naturally occurred in ...

متن کامل

Fundamental Matrix Estimation using Evolutionary Algorithms with Multi-Objective Functions

In this paper, we present the use of two evolutionary algorithms to estimate fundamental matrices. We first propose a modification of the Hybrid Taguchi Genetic Algorithm (HTGA) that employs a single objective function, either geometric or algebraic distance, for optimization. We then propose to use a multi-objective optimization algorithm, Intelligent Multi-Objective Evolutionary Algorithm (IM...

متن کامل

MOCS: Multi-objective Clustering Selection Evolutionary Algorithm

In this paper, we describe a multi-objective evolutionary algorithm, that uses clustering selection and does not need any additional parameter like others. It clusters the population into a exible number of clusters employing x-means from [Pelleg and Moore, 2000]. First, the selective tness is assigned to clusters and in second place to individuals of clusters. We show three hybrid variants inc...

متن کامل

A Novel Multi-objective Evolutionary Algorithm

Evolutionary Algorithms are recognized to be efficient to deal withMulti-objective Optimization Problems(MOPs) which are difficult to be solved with traditional methods. Here a newMulti-objective Optimization Evolutionary Algorithm named DGPS which is compound with Geometrical Pareto Selection Method (GPS), Weighted SumMethod (WSM) and Dynamical Evolutionary Algorithm (DEA) is proposed. Some fa...

متن کامل

Evolutionary Rough Parallel Multi-Objective Optimization Algorithm

A hybrid unsupervised learning algorithm, which is termed as Parallel Rough-based Archived Multi-Objective Simulated Annealing (PARAMOSA), is proposed in this article. It comprises a judicious integration of the principles of the rough sets theory and the scalable distributed paradigm with the archived multi-objective simulated annealing approach. While the concept of boundary approximations of...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematics

سال: 2022

ISSN: ['2227-7390']

DOI: https://doi.org/10.3390/math10122077